Dynamics of piecewise linear maps and sets of nonnegative matrices I . Bondarenko December 2 , 2008
نویسنده
چکیده
We consider functions f v = min A∈K Av and gv = max A∈K Av, where K is a finite set of nonnegative matrices and by " min " and " max " we mean coordinate-wise minimum and maximum. We transfer known results about properties of g to f. In particular we show existence of nonnegative generalized eigenvectors for f , give necessary and sufficient conditions for existence of strictly positive eigenvector for f , study dynamics of f on the positive cone. We show the existence and construct matrices A and B, possibly not in K, such that f n v ∼ A n v and g n v ∼ B n v for any strictly positive vector v.
منابع مشابه
Dynamics of piecewise linear maps and sets of nonnegative matrices
We consider maps fK(v) = minA∈K Av and gK(v) = maxA∈KAv, where K is a finite set of nonnegative matrices and by “min” and “max” we mean component-wise minimum and maximum. We transfer known results about properties of gK to fK. In particular we show existence of nonnegative generalized eigenvectors of fK, give necessary and sufficient conditions for existence of strictly positive eigenvector of...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملA conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
A scaling of a nonnegative matrix A is a matrix XA Y -I. where X and Yare nonsingular. nonnegative diagonal matrices. Some condition may be imposed on the scaling, for exa'mple. when A is square, X = Y or det X = det Y. We characterize matrices for ' which there exists a scaling that satisfies predetermined upper and lower bound. Our principal tools are a piecewise linear theorem of the alterna...
متن کاملPc { Matrices and the Linear Complementarity
We introduce a new matrix class Pc, which consists of those matrices M for which the solution set of the corresponding linear complementarity problem is connected for every q 2 I R n. We consider Lemke's pivotal method from the perspective of piecewise linear homotopies and normal maps and show that Lemke's method processes all matrices in Pc \Q0. We further investigate the relationship of the ...
متن کاملSingular values of convex functions of matrices
Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$ are nonzero matrices and each $X_{i}$ is positive semidefinite. It is shown that if $f$ is a nonnegative increasing convex function on $left[ 0,infty right) $ satisfying $fleft( 0right) =0 $, then $$2s_{j}left( fleft( fra...
متن کامل